Producing the skeleton of a character
Identifieur interne : 002205 ( Main/Exploration ); précédent : 002204; suivant : 002206Producing the skeleton of a character
Auteurs : Jakob Gonczarowski [Israël]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Abstract
Abstract: We present an algorithm that produces a skeleton for an outline character. The algorithm precisely finds the strokes in the skeleton by using the centers of the curves in the character, and by scanning the character in prescribed scanline directions. Gaps (which are caused by only scanning at angles) are then filled and unwanted curves/strokes are then deleted. This scanning process leaves holes at points where a topological change occurs. The filling of these holes is done by a heuristic method: First, short curves at the ends of strokes are ignored; then, the strokes are lengthened by smoothly adding straight lines, and the lines opposite each other are connected. The proposed algorithm is demonstrated with several characters, also showing the limitation of the algorithm at its last step.
Url:
DOI: 10.1007/BFb0053263
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F77
- to stream Istex, to step Curation: 000F29
- to stream Istex, to step Checkpoint: 001709
- to stream Main, to step Merge: 002322
- to stream Main, to step Curation: 002205
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Producing the skeleton of a character</title><author><name sortKey="Gonczarowski, Jakob" sort="Gonczarowski, Jakob" uniqKey="Gonczarowski J" first="Jakob" last="Gonczarowski">Jakob Gonczarowski</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:BCD5199AF1958AA65395CCD666253A92E3B8A29A</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0053263</idno><idno type="url">https://api.istex.fr/document/BCD5199AF1958AA65395CCD666253A92E3B8A29A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F77</idno><idno type="wicri:Area/Istex/Curation">000F29</idno><idno type="wicri:Area/Istex/Checkpoint">001709</idno><idno type="wicri:doubleKey">0302-9743:1998:Gonczarowski J:producing:the:skeleton</idno><idno type="wicri:Area/Main/Merge">002322</idno><idno type="wicri:Area/Main/Curation">002205</idno><idno type="wicri:Area/Main/Exploration">002205</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Producing the skeleton of a character</title><author><name sortKey="Gonczarowski, Jakob" sort="Gonczarowski, Jakob" uniqKey="Gonczarowski J" first="Jakob" last="Gonczarowski">Jakob Gonczarowski</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Typographics, Ltd., 46 Hehalutz St., 96222, Jerusalem</wicri:regionArea><wicri:noRegion>Jerusalem</wicri:noRegion></affiliation><affiliation><wicri:noCountry code="no comma">E-mail: j.gon@computer.org</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1998</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">BCD5199AF1958AA65395CCD666253A92E3B8A29A</idno><idno type="DOI">10.1007/BFb0053263</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present an algorithm that produces a skeleton for an outline character. The algorithm precisely finds the strokes in the skeleton by using the centers of the curves in the character, and by scanning the character in prescribed scanline directions. Gaps (which are caused by only scanning at angles) are then filled and unwanted curves/strokes are then deleted. This scanning process leaves holes at points where a topological change occurs. The filling of these holes is done by a heuristic method: First, short curves at the ends of strokes are ignored; then, the strokes are lengthened by smoothly adding straight lines, and the lines opposite each other are connected. The proposed algorithm is demonstrated with several characters, also showing the limitation of the algorithm at its last step.</div></front></TEI><affiliations><list><country><li>Israël</li></country></list><tree><country name="Israël"><noRegion><name sortKey="Gonczarowski, Jakob" sort="Gonczarowski, Jakob" uniqKey="Gonczarowski J" first="Jakob" last="Gonczarowski">Jakob Gonczarowski</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002205 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002205 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:BCD5199AF1958AA65395CCD666253A92E3B8A29A
|texte= Producing the skeleton of a character
}}
| This area was generated with Dilib version V0.6.32. |  |